Adds an item to the end of the BigList. The indices of all existing items in the Deque are unchanged.

Concatenates two lists together to create a new list. Both lists being concatenated are unchanged. The resulting list contains all the items in first, followed by all the items in second.

Adds an item to the beginning of the BigList. The indices of all existing items in the Deque are increased by one, and the new item has index zero.

Provides a read-only view of this list. The returned IList<T> provides a view of the list that prevents modifications to the list. Use the method to provide access to the list without allowing changes. Since the returned object is just a view, changes to the list will be reflected in the view.

Removes all of the items from the BigList.

Creates a new BigList that is a copy of this list.

Makes a deep clone of this BigList. A new BigList is created with a clone of each element of this set, by calling ICloneable.Clone on each element. If T is a value type, then this method is the same as Clone.

Determines if the list contains any item that compares equal to item. The implementation simply checks whether IndexOf(item) returns a non-negative value.

Convert the list to a new list by applying a delegate to each item in the collection. The resulting list contains the result of applying converter to each item in the list, in order. The current list is unchanged.

Counts the number of items in the collection that satisfy the condition defined by predicate.

Determines whether the specified Object is equal to the current Object.

Determines if the collection contains any item that satisfies the condition defined by predicate.

Finds the first item in the list that satisfies the condition defined by predicate. If no item matches the condition, than the default value for T (null or all-zero) is returned.

Enumerates the items in the collection that satisfy the condition defined by predicate.

Finds the last item in the list that satisfies the condition defined by predicate. If no item matches the condition, than the default value for T (null or all-zero) is returned.

Performs the specified action on each item in this collection.

Enumerates all of the items in the list, in order. The item at index 0 is enumerated first, then the item at index 1, and so on. Usually, the foreach statement is used to call this method implicitly.

Serves as a hash function for a particular type. GetHashCode()() is suitable for use in hashing algorithms and data structures like a hash table.

Creates a new list that contains a subrange of elements from this list. The current list is unchanged.

Gets the Type of the current instance.

Inserts a new item at the given index in the BigList. All items at indexes equal to or greater than index move up one index.

Prints out the internal structure of the tree, for debugging purposes.

Returns a view onto a sub-range of this list. Items are not copied; the returned IList<T> is simply a different view onto the same underlying items. Changes to this list are reflected in the view, and vice versa. Insertions and deletions in the view change the size of the view, but insertions and deletions in the underlying list do not.

Searches the list for the first item that compares equal to item. If one is found, it is removed. Otherwise, the list is unchanged.

Removes all the items in the collection that satisfy the condition defined by predicate.

Removes the item at the given index in the BigList. All items at indexes greater than index move down one index.

Removes a range of items at the given index in the Deque. All items at indexes greater than index move down count indices in the Deque.

Creates an array of the correct size, and copies all the items in the collection into the array, by calling CopyTo.

Shows the string representation of the collection. The string representation contains a list of the items in the collection. Contained collections (except string) are expanded recursively.

Determines if all of the items in the collection satisfy the condition defined by predicate.

Finds the first item in the list that satisfies the condition defined by predicate.

Finds the last item in the list that satisfies the condition defined by predicate.

Attempts to validate the internal consistency of the tree.

Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection.

Creates a shallow copy of the current Object.

Gets the number of items stored in the BigList. The indices of the items range from 0 to Count-1.

Gets or sets an item in the list, by index.

Copies all the items in the collection into an array. Implemented by using the enumerator returned from GetEnumerator to get all the items and copy them to the provided array.

Indicates whether the collection is synchronized.

Indicates the synchronization object for this collection.

Provides an IEnumerator that can be used to iterate all the members of the collection. This implementation uses the IEnumerator<T> that was overridden by the derived classes to enumerate the members of the collection.

Adds an item to the end of the list. This method is equivalent to calling:

Removes all the items from the list, resulting in an empty list.

Determines if the list contains any item that compares equal to value.

Find the first occurrence of an item equal to value in the list, and returns the index of that item.

Insert a new item at the given index.

Returns whether the list is a fixed size. This implementation always returns false.

Returns whether the list is read only. This implementation returns the value from ICollection<T>.IsReadOnly, which is by default, false.

Gets or sets the value at a particular index in the list.

Searches the list for the first item that compares equal to value. If one is found, it is removed. Otherwise, the list is unchanged.

Removes the item at the given index.

Creates a new BigList that is a copy of this list.